Intersection Dimension and Maximum Degree
نویسندگان
چکیده
We show that the intersection dimension of graphs with respect to several hereditary graph classes can be bounded as a function of the maximum degree. As an interesting special case, we show that the circular dimension of a graph with maximum degree ∆ is at most O(∆ log∆ log log∆). We also obtain bounds in terms of treewidth.
منابع مشابه
Intersection of Acm-curves in P
In this note we address the problem of determining the maximum number of points of intersection of two arithmetically Cohen-Macaulay curves in P. We give a sharp upper bound for the maximum number of points of intersection of two irreducible arithmetically Cohen-Macaulay curves Ct and Ct−r in P 3 defined by the maximal minors of a t× (t+ 1), resp. (t− r)× (t − r + 1), matrix with linear entries...
متن کاملBoxicity and maximum degree
An axis-parallel d–dimensional box is a Cartesian product R1 × R2 × · · · × Rd where Ri (for 1 ≤ i ≤ d) is a closed interval of the form [ai, bi] on the real line. For a graph G, its boxicity box(G) is the minimum dimension d, such that G is representable as the intersection graph of (axis–parallel) boxes in d–dimensional space. The concept of boxicity finds applications in various areas such a...
متن کاملروابط جدید زمان چرخه بهینه برای تقاطع‌های پیش‌زمان‌بندی شده مستقل با تغییر رابطه وبستر براساس روش HCM 2000
When the degree of saturation at intersection approaches one, Webster’s optimum cycle length equation becomes inapplicable, because the cycle length will becomes very big when the degree of saturation approaches one and will be fully unrealistic when the degree of saturation becomes greater than one. This is not a problem for HCM2000 method. But optimum cycle length calculation in this method h...
متن کاملLocal Cohomology with Respect to a Cohomologically Complete Intersection Pair of Ideals
Let $(R,fm,k)$ be a local Gorenstein ring of dimension $n$. Let $H_{I,J}^i(R)$ be the local cohomology with respect to a pair of ideals $I,J$ and $c$ be the $inf{i|H_{I,J}^i(R)neq0}$. A pair of ideals $I, J$ is called cohomologically complete intersection if $H_{I,J}^i(R)=0$ for all $ineq c$. It is shown that, when $H_{I,J}^i(R)=0$ for all $ineq c$, (i) a minimal injective resolution of $H_{I,...
متن کاملForbidden Subgraph Colorings, Oriented Colorings and Intersection Dimensions of Graphs
This thesis deals mainly with two related coloring problems forbidden subgraph colorings and oriented colorings. The former deals with proper colorings of vertices or edges of a graph with constraints on the union of color classes. A well-known example is the acyclic vertex coloring in which we require a proper coloring such that the union of any two color classes is acyclic. Other wellstudied ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 35 شماره
صفحات -
تاریخ انتشار 2009